|
Daniel Lazard (born December 10, 1941 in Carpentras) is a French mathematician and computer scientist. He is emeritus professor at Université Pierre et Marie Curie. He began his academic career by working in commutative algebra, especially on flat modules. Around 1970, he began to work in computer algebra, which, soon after, became his main research area. In this field, he is specially interested in multivariate polynomials and more generally in computational algebraic geometry, with emphasis on polynomial system solving. ==Selected contributions== * noted that a module M is flat if and only if it is a direct limit of finitely-generated free modules. As a consequence, one can deduce that every finitely-presented flat module is projective. (See flat module#Categorical colimits) * In computer algebra, the resultant of two polynomials can be used to analyze modular images of the greatest common divisor of integer polynomials where the coefficients are taken modulo some prime number ''p''. The resultant of two polynomials is frequently computed in the Lazard-Rioboo-Trager method of finding the integral of a ratio of polynomials. * introduced the ''lextriangular algorithm'' to obtain the triangular decomposition of a polynomial system. See System of polynomial equations#Regular chains. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Daniel Lazard」の詳細全文を読む スポンサード リンク
|